On constructing minimum spanning trees in Rk 1 Sergei
نویسنده
چکیده
We give an algorithm to nd a minimum spanning tree in the k-dimensional space under rectilinear metric. The running time is O(8 k p k n(lg n) k?2 lg lg n) for k 3. This improves the previous bound by a factor p k lg 2 n=4 k .
منابع مشابه
On Central Spanning Trees of a Graph
We consider the collection of all spanning trees of a graph with distance between them based on the size of the symmetric difference of their edge sets. A central spanning tree of a graph is one for which the maximal distance to all other spanning trees is minimal. We prove that the problem of constructing a central spanning tree is algorithmically difficult and leads to an NP-complete problem.
متن کاملSpanning Trees and Spanners
We survey results in geometric network design theory, including algorithms for constructing minimum spanning trees and low-dilation graphs.
متن کاملA multivariate two-sample test using the Voronoi diagram
[12] A. C. Yao. On constructing minimum spanning trees in k-dimensional space and related problems.
متن کاملPolynomial-Time Space-Optimal Silent Self-Stabilizing Minimum-Degree Spanning Tree Construction
Motivated by applications to sensor networks, as well as to many other areas, this paper studies the construction of minimum-degree spanning trees. We consider the classical noderegister state model, with a weakly fair scheduler, and we present a space-optimal silent self-stabilizing construction of minimum-degree spanning trees in this model. Computing a spanning tree with minimum degree is NP...
متن کاملTrees in Graphs with Conflict Edges or Forbidden Transitions
In a recent paper [Paths, trees and matchings under disjunctive constraints, Darmann et. al., Discr. Appl. Math., 2011] the authors add to a graph G a set of conflicts, i.e. pairs of edges of G that cannot be both in a subgraph of G. They proved hardness results on the problem of constructing minimum spanning trees and maximum matchings containing no conflicts. A forbidden transition is a parti...
متن کامل